Average Convergence Behavior of the FastICA Algorithm for Blind Source Separation

نویسندگان

  • Scott C. Douglas
  • Zhijian Yuan
  • Erkki Oja
چکیده

The FastICA algorithm is a popular procedure for independent component analysis and blind source separation. In this paper, we analyze the average convergence behavior of the single-unit FastICA algorithm with kurtosis contrast for general m-source noiseless mixtures. We prove that this algorithm causes the average inter-channel interference (ICI) to converge exponentially with a rate of (1/3) or -4.77dB at each iteration, independent of the source mixture kurtoses. Explicit expressions for the average ICI for the threeand four-source mixture cases are also derived, along with an exact expression for the average ICI in a particular situation. Simulations verify the accuracy of the analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A S#a#is#ica& C'()e+,e(ce A(a&-sis '. #/e .as#ica A&,'+i#/0 .'+ #1'-s'3+ce 0i4#3+es

While the FastICA algorithm is a popular procedure for independent component analysis (ICA) and blind source separation, its average convergence behavior has yet to be studied. This paper provides several statistical convergence analyses of the kurtosis-based FastICA algorithm for two-source noiseless mixtures. We derive explicit and approximate expressions for the evolutions of the average val...

متن کامل

Calculation of Leakage in Water Supply Network Based on Blind Source Separation Theory

The economic and environmental losses due to serious leakage in the urban water supply network have increased the effort to control the water leakage. However, current methods for leakage estimation are inaccurate leading to the development of ineffective leakage controls. Therefore, this study proposes a method based on the blind source separation theory (BSS) to calculate the leakage of water...

متن کامل

Fast Algorithms for Bayesian Independent Component Analysis

Fast algorithms for linear blind source separation are developed. The fast convergence is rst derived from low-noise approximation of the EM-algorithm given in 2], to which a modiication is made that leads as a special case to the FastICA algorithm 5]. The modii-cation is given a general interpretation and is applied to Bayesian blind source separation of noisy signals.

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006